Non-expansion Visual Secret Sharing in Reversible Style
نویسنده
چکیده
This paper proposed a novel reversible visual secret sharing method. Without any computing, if we stack two transparencies directly, a secret image will appear. Stacking two transparencies after reversing one of transparencies, another secret image will unveil. Different from traditional reversible visual cryptography, the method not only has advantages but also will not have pixel expansion and code-book. Besides, the same idea can be extended to complex style visual cryptography.
منابع مشابه
Maximizing the Secret Hiding Ratio in Visual Secret Sharing with Reversible Property
This paper proposed a new visual secret sharing method. The property of visual secret sharing in reversible style is that it can be applied without depending on any computing If one stacks two transparencies together straightforwardly, a secret image will appear. Stacking two transparencies after reversing one of the transparencies, another secret image will unveil. Different from the tradition...
متن کاملA Robust Three-Way Authentication System using Modified Random Grid based Reversible Style Visual Cryptography
The growing possibilities of modern communications require a special means of confidential and intellectual property protection against unauthorized access and use. Cryptography provides important tools for the protection of information and they are used in many aspects of computer security. This paper makes use of encrypted secret sharing to increases the security level of hidden data and to p...
متن کاملOn the Pixel Expansion of Hypergraph Access Structures in Visual Cryptography Schemes
In a visual cryptography scheme, a secret image is encoded into n shares, in the form of transparencies. The shares are then distributed to n participants. Qualified subsets of participants can recover the secret image by superimposing their transparencies, but non-qualified subsets of participants have no information about the secret image. Pixel expansion, which represents the number of subpi...
متن کاملA New Simple Non-Expansion Algorithm for (2,2) - Visual Secret Sharing Scheme
Visual cryptography (VC) is a powerful encryption technique which combines perfect secrecy and secret sharing in cryptography with respect to images. VC takes a binary image (the secret) and divides it into two or more pieces known as shares (transparencies). When the shares are superimposed, the secret can be recovered. One of the distinguishing features of VC is that it needs no computational...
متن کاملA Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions
A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...
متن کامل